Planar cover

Results: 21



#Item
11CCCG 2011, Toronto ON, August 10–12, 2011  Approximating the Obstacle Number for a Graph Drawing Efficiently∗ Deniz Sarı¨oz†  Abstract

CCCG 2011, Toronto ON, August 10–12, 2011 Approximating the Obstacle Number for a Graph Drawing Efficiently∗ Deniz Sarı¨oz† Abstract

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:12
12CCCG 2011, Toronto ON, August 10–12, 2011  Approximating the Obstacle Number for a Graph Drawing Efficiently∗ Deniz Sarı¨oz†  Abstract

CCCG 2011, Toronto ON, August 10–12, 2011 Approximating the Obstacle Number for a Graph Drawing Efficiently∗ Deniz Sarı¨oz† Abstract

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:12
13Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs

Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2013-11-08 11:23:34
1414th Workshop of the ICA commission on Generalisation and Multiple Representation 30th of June and 1st of July, Paris Automated generalisation of land cover data in a planar topographic map John van Smaalen, Esri Nederla

14th Workshop of the ICA commission on Generalisation and Multiple Representation 30th of June and 1st of July, Paris Automated generalisation of land cover data in a planar topographic map John van Smaalen, Esri Nederla

Add to Reading List

Source URL: generalisation.icaci.org

Language: English - Date: 2013-02-05 05:21:17
15Local Search: Is Brute-Force Avoidable?

Local Search: Is Brute-Force Avoidable?

Add to Reading List

Source URL: ijcai.org

Language: English - Date: 2009-06-22 08:17:00
16Automated generalisation of land cover data in a planar topographic map John van Smaalen1, Ron Nijhuis2, Jantien Stoter2,3,4 1Esri

Automated generalisation of land cover data in a planar topographic map John van Smaalen1, Ron Nijhuis2, Jantien Stoter2,3,4 1Esri

Add to Reading List

Source URL: generalisation.icaci.org

Language: English - Date: 2013-02-05 05:23:30
17ON STABLE CYCLES AND CYCLE DOUBLE COVERS OF GRAPHS WITH LARGE CIRCUMFERENCE JONAS HÄGGLUND AND KLAS MARKSTRÖM Abstract. A cycle C in a graph is called stable if there exist no other cycle D in the same graph such that

ON STABLE CYCLES AND CYCLE DOUBLE COVERS OF GRAPHS WITH LARGE CIRCUMFERENCE JONAS HÄGGLUND AND KLAS MARKSTRÖM Abstract. A cycle C in a graph is called stable if there exist no other cycle D in the same graph such that

Add to Reading List

Source URL: abel.math.umu.se

Language: English - Date: 2013-12-11 09:07:23
18Even cycle decompositions of 4-regular graphs and line graphs Klas Markstr¨ om Abstract. An even cycle decomposition of a graph is a partition of its edge into even cycles. We first give some results on the existence of

Even cycle decompositions of 4-regular graphs and line graphs Klas Markstr¨ om Abstract. An even cycle decomposition of a graph is a partition of its edge into even cycles. We first give some results on the existence of

Add to Reading List

Source URL: abel.math.umu.se

Language: English - Date: 2013-12-11 09:07:23
19Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP Jin-Yi Cai∗ Pinyan Lu†

Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP Jin-Yi Cai∗ Pinyan Lu†

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2010-07-10 15:34:42
2020 Years of Negami’s Planar Cover Conjecture Petr Hlinˇ en´ y∗ Faculty of Informatics, Masaryk University Botanick´a 68a, [removed]Brno, Czech Republic

20 Years of Negami’s Planar Cover Conjecture Petr Hlinˇ en´ y∗ Faculty of Informatics, Masaryk University Botanick´a 68a, [removed]Brno, Czech Republic

Add to Reading List

Source URL: www.fi.muni.cz

Language: English - Date: 2010-04-01 04:30:25